Paths in r-partite self-complementary graphs
نویسندگان
چکیده
منابع مشابه
Unmixed $r$-partite graphs
Unmixed bipartite graphs have been characterized by Ravindra and Villarreal independently. Our aim in this paper is to characterize unmixed $r$-partite graphs under a certain condition, which is a generalization of Villarreal's theorem on bipartite graphs. Also, we give some examples and counterexamples in relevance to this subject.
متن کاملRainbow Matchings in r-Partite r-Graphs
Given a collection of matchings M = (M1,M2, . . . ,Mq) (repetitions allowed), a matching M contained in ⋃ M is said to be s-rainbow for M if it contains representatives from s matchings Mi (where each edge is allowed to represent just one Mi). Formally, this means that there is a function φ : M → [q] such that e ∈ Mφ(e) for all e ∈ M , and |Im(φ)| > s. Let f(r, s, t) be the maximal k for which ...
متن کاملPerfect matchings in r-partite r-graphs
Let H be an r-partite r-graph, all of whose sides have the same size n. Suppose that there exist two sides of H , each satisfying the following condition: the degree of each legal r−1-tuple contained in the complement of this side is strictly larger than n 2 . We prove that under this condition H must have a perfect matching. This answers a question of Kühn and Osthus.
متن کاملFactors of r-partite graphs
We give sufficient conditions for a tripartite graph to have a spanning subgraph consisting of complete graphs of order 3. This is applied to bound the strong chromatic number of a graph.
متن کاملIntegral complete r-partite graphs
A graph is called integral if all the eigenvalues of its adjacency matrix are integers. In this paper, we give a useful sufficient and necessary condition for complete r-partite graphs to be integral, from which we can construct infinite many new classes of such integral graphs. It is proved that the problem of finding such integral graphs is equivalent to the problem of solving some Diophantin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1980
ISSN: 0012-365X
DOI: 10.1016/0012-365x(80)90261-7